Affine Automata Verifiers
نویسندگان
چکیده
We initiate the study of verification power Affine finite automata (AfA) as a part Arthur-Merlin (AM) proof systems. show that every unary language is verified by real-valued AfA verifier. Then, we focus on verifiers restricted to have only integer-valued or rational-valued transitions. observe can be simulated verifiers, and their protocols in nondeterministic polynomial time. this upper bound tight presenting an verifier for NP-complete problem SUBSETSUM. also AfAs verify certain non-affine non-stochastic languages.
منابع مشابه
Affine counter automata
We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, ...
متن کاملOn the Computational Power of Affine Automata
Abstract. We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of ...
متن کاملLimit Measures for Affine Cellular Automata II
If M is a monoid, and A is an abelian group, then A is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F : A −→ A that commutes with all shift maps. If F is diffusive, and μ is a harmonically mixing (HM) probability measure on A, then the sequence {Fμ}N=1 weak*-converges to the Haar measure on A, in density. Fully supported Markov measures on A are HM, an...
متن کاملLimit Measures for Affine Cellular Automata
Let M be a monoid (e.g. N, Z, or Z), and A an abelian group. A is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F : A −→ A that commutes with all shift maps. Let μ be a (possibly nonstationary) probability measure on A; we develop sufficient conditions on μ and F so that the sequence {Fμ}N=1 weak*-converges to the Haar measure on A, in density (and...
متن کاملDiscretizing Affine Hybrid Automata with Uncertainty
Over-approximating the set of all reachable states of a given system is an important task for the verification of safety properties. Such an unbounded time verification is in particular challenging for hybrid systems. We recently developed an algorithm that over-approximates the set of all reachable states of a given affine hybrid automata by performing linear template-based abstract interpreta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-87993-8_6